"Pay bursts only once" does not hold for non-FIFO guaranteed rate nodes
نویسندگان
چکیده
We consider end-to-end delay bounds in a network of Guaranteed Rate (GR) nodes. We demonstrate that, contrary to what is generally believed, the existing end-to-end delay bounds apply only to GR nodes that are FIFO per flow. We show this by exhibiting a counter-example. Then we show that the proof of the existing bounds has a subtle, but important, dependency on the FIFO assumption, which was never noticed before. Finally, we give a tight delay bound that is valid in the non-FIFO case; it is noticeably higher that the existing one. In particular, the phenomenon known as “pay bursts only once” does not apply to non-FIFO nodes. These findings are important in the context of differentiated services. Indeed the existing bounds have been applied to cases where a flow (in the sense of the GR definition) is an aggregate of end-user microflows, and it is not generally true that a router is FIFO per aggregate; thus the GR node model of a differentiated services router cannot always be assumed to be FIFO per flow.
منابع مشابه
Proofs for draft - ietf - diffserv - ef - supplemental - 01 . txt June 2001
The delay bound in section 3.1 is a corollary of Theorem 10.1, and the fact that the packet-identity-aware definition is stronger than the guaranteed rate clock definition, as shown in the following corollary. We say that a node satisfy the guaranteed rate clock property [1] with rate Ö and latency if the departure time Ò of the Òth packet (numbered by order of arrival) is such that Ò Ò · , whe...
متن کاملEnd-to-End Worst-Case Analysis of Non-FIFO Systems
In this report, delay bounds in data flow systems with nonFIFO service disciplines are explored. It is shown that conventional network calculus definitions of a service curve are not satisfying under the assumption of non-FIFO service. Either the definition is too strict to allow for a concatenation and consequent beneficial end-to-end analysis, or it is too loose and thus results in infinite d...
متن کاملExtending the Network Calculus Pay Bursts Only Once Principle to Aggregate Scheduling
The Differentiated Services framework allows to provide scalable network Quality of Service by aggregate scheduling. Services, like a Premium class, can be defined to offer a bounded end-to-end delay. For such services, the methodology of Network Calculus has been applied successfully in Integrated Services networks to derive upper bounds on the delay of individual flows. Recent extensions allo...
متن کاملPerformance Bounds in Feed-Forward Networks under Blind Multiplexing
Bounding performance characteristics in communication networks is an important and interesting issue. In this study we assume uncertainty about the way di erent ows in a network are multiplexed, we even drop the common FIFO assumption. Under so-called blind multiplexing we derive new bounds for the tractable, yet non-trivial case of feed-forward networks. This is accomplished for pragmatic, but...
متن کاملDelay bounds for a network of guaranteed rate servers with FIFO aggregation
To support quality of service guarantees in a scalable manner, aggregate scheduling has attracted a lot of attention in the networking community. However, while there are a large number of results available for flow-based scheduling algorithms, few such results are available for aggregate-based scheduling. In this paper, we study a network implementing Guaranteed Rate (GR) scheduling with First...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Perform. Eval.
دوره 62 شماره
صفحات -
تاریخ انتشار 2005